Disjunctive answer set solvers via templates
نویسندگان
چکیده
منابع مشابه
Disjunctive answer set solvers via templates
Answer set programming is a declarative programming paradigm oriented towards difficult combinatorial search problems. A fundamental task in answer set programming is to compute stable models, i.e., solutions of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has a stable model is Σ2 -complete. The high complexity...
متن کاملAbstract Disjunctive Answer Set Solvers
Disjunctive Answer Set Solvers Remi Brochenin1 and Yuliya Lierler2 and Marco Maratea3 Abstract. A fundamental task in answer set programming is to compute answer sets of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has an answer set is Σ2 -complete. The high complexity of reasoning within disjunctive logic prog...
متن کاملDisjunctive Answer Set Programming via Satisfiability
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondisjunctive programs. This paper proposes a way to use SAT solvers for finding answer sets for disjunctive logic programs. We implement two different ways of SAT solver invocation use...
متن کاملAbstract Answer Set Solvers
Answer Set Solvers Yuliya Lierler University of Texas at Austin [email protected] Abstract Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithms that generate answer sets for logic programs: SMODELS, ASP-SAT with Backtracking, an...
متن کاملAnswer Set Programming with Templates
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures. We show how ASP can be extended with ‘template’ predicate’s definitions by introducing a wellsuited form of second order logics. We present language syntax and give its operational semantics. We show that the theory supporting o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2015
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068415000411